A general method for constructing essential uniform algebras
نویسندگان
چکیده
منابع مشابه
A Method of Constructing Braided Hopf Algebras
Let A and B be two Hopf algebras and R ∈ Hom(B ⊗ A, A ⊗ B), the twisted tensor product Hopf algebra A#RB was introduced by S. Caenepeel et al in [3] and further studied in our recent work [6]. In this paper we give the necessary and sufficient conditions for A#RB to be a Hopf algebra with a projection. Furthermore, a braided Hopf algebra A is constructed by twisting the multiplication of A thro...
متن کاملA Supervised Method for Constructing Sentiment Lexicon in Persian Language
Due to the increasing growth of digital content on the internet and social media, sentiment analysis problem is one of the emerging fields. This problem deals with information extraction and knowledge discovery from textual data using natural language processing has attracted the attention of many researchers. Construction of sentiment lexicon as a valuable language resource is a one of the imp...
متن کاملA general Method for Constructing Pseudo-Gaussian Tests
A general method for constructing pseudo-Gaussian tests—reducing to traditional Gaussian tests under Gaussian densities but remaining valid under non-Gaussian ones—is proposed. This method provides a solution to several open problems in classical multivariate analysis. One of them is the test of homogeneity of covariance matrices, an assumption that plays a crucial role in multivariate analysis...
متن کاملA General Chaining Method for Constructing Hash Functions
MD5 is an older algorithm (1992) devised by Rivest. We present an overview of it here. It generates a 128-bit message digest from an input message of any length. It is built from a basic block function g : 128-bit× 512-bit→ 128-bit. The MD5 hash function h is obtained as follows: First the original message is padded to length a multiple of 512. The result m is split into a sequence of 512-bit b...
متن کاملA General Performance Analysis Method for Uniform Memory Architectures
The performance of a multiprocessor system greatly depends on the bandwidth of its memory architecture. In this paper, uniform memory architectures with various interconnection networks including crossbar, multiple-buses and generalized shuffle networks are studied. We propose a general method based on the Markov chain model by assuming that the blocked memory requests will be redistributed to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2019
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm170907-23-2